Describing 3-paths in normal plane maps
نویسندگان
چکیده
We prove that every normal plane map, as well as every 3polytope, has a path on three vertices whose degrees are bounded from above by one of the following triplets: $(3,3,\infty)$, $(3,4,11)$, $(3,7,6)$, $(3,10,4)$, $(3,15,3)$, $(4,4,9)$, $(6,4,8)$, $(7,4,7)$, and $(6,5,6)$. No parameter of this description can be improved, as shown by appropriate 3-polytopes. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 Describing 3-paths in normal plane maps O.V. Borodin∗ A.O. Ivanova† T.R. Jensen‡ A.V. Kostochka§ M.P. Yancey¶
منابع مشابه
On the structural result on normal plane maps
We prove the structural result on normal plane maps, which applies to the vertex distance colouring of plane maps. The vertex distance-t chromatic number of a plane graph G with maximum degree ∆(G) ≤ D, D ≥ 12 is proved to be upper bounded by 6+ 2D+12 D−2 ((D−1)(t−1)−1). This improves a recent bound 6 + 3D+3 D−2 ((D − 1)t−1 − 1), D ≥ 8 by Jendrol’ and Skupień, and the upper bound for distance-2...
متن کاملAn Improved Algorithm for the Metro-line Crossing Minimization Problem
In the metro-line crossing minimization problem, we are given a plane graph G = (V,E) and a set L of simple paths (or lines) that cover G, that is, every edge e ∈ E belongs to at least one path in L. The problem is to draw all paths in L along the edges of G such that the number of crossings between paths is minimized. This crossing minimization problem arises, for example, when drawing metro m...
متن کاملMinimal vertex degree sum of a 3-path in plane maps
Let wk be the minimum degree sum of a path on k vertices in a graph. We prove for normal plane maps that: (1) if w2 = 6, then w3 may be arbitrarily big, (2) if w2 > 6, then either w3 ≤ 18 or there is a ≤ 15-vertex adjacent to two 3-vertices, and (3) if w2 > 7, then w3 ≤ 17.
متن کاملNormal Holomorphic Maps from C
A theorem of A. Ostrowski describing meromorphic functions f such that the family {f(λz) : λ ∈ C} is normal, is generalized to holomorphic maps from C∗ to a projective space. Let f : C → P be a holomorphic curve and (1) F = (g0, g1, . . . , gn) some homogeneous representation of f . This means that gj are analytic functions in C without common zeros. When n = 1, we have P = C, and f can be iden...
متن کاملSink Location Service Based on Fano Plane in Wireless Sensor Networks
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013